Need to Combine Interval and Probabilistic Uncertainty: What Needs to Be Computed, What Can Be Computed, What Can Be Feasibly Computed, and How Physics Can Help
نویسندگان
چکیده
In many practical situations, the quantity of interest is difficult to measure directly. such estimate this quantity, we easier-to-measure quantities which are related desired one by a known relation, and use results these measurement quantity. How accurate estimate? Traditional engineering approach assumes that know probability distributions errors; however, in practice, often only have partial information about distributions. some cases, upper bounds on thing actual value each measured it somewhere corresponding interval. Interval computation estimates range possible values under interval uncertainty. other addition intervals, also probabilities. paper, describe how solve problem linearized case, what computable feasibly general and, somewhat surprisingly, physics ideas – initial conditions not abnormal, every theory approximate can help with computations.
منابع مشابه
What Can Be Computed Locally?
1 Summary The paper [1] deals with locality on several levels: It introduces a model for distributed computations and the notion of locally checkable labelings (LCLs). It proves properties about algorithms for locally checkable labeling problems. Two algorithms are analyzed in detail: One for the Weak Coloring problem and one for the Formal Dining Philosophers problem. The paper shows fundament...
متن کاملWhat Can Be Computed in Algebraic Geometry?
This paper evolved from a long series of discussions between the two authors, going back to around 1980, on the problems of making effective computations in algebraic geometry, and it took more definite shape in a survey talk given by the second author at a conference on Computer Algebra in 1984. The goal at that time was to bring together the perspectives of theoretical computer scientists and...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملO5: Technical Accident Reconstruction-What Can be Learned to Improve Medical Treatment in Trauma Patients
Annually, more than 1 million people were killed in road traffic accidents worldwide every year and an uncounted number were severe injured. In 2012 fatal injuries caused by road traffic accidents are under the top ten lists of causes of death in the world. It´s expected that in the near future road traffic accidents become one of the main causes of death in the world. Most of these fatal injur...
متن کاملDecision Making under Interval Uncertainty: What Can and What Cannot Be Computed in Linear Time and in Real Time
In engineering, we constantly need to make decisions: which design to select, which parameters to select for this design, etc. The traditional approach to decision making is based on the assumption that we know all possible consequences of each alternative, and we know the probability of each such consequence. Under this assumption, we can describe a rational decision-making process: to each po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studies in fuzziness and soft computing
سال: 2023
ISSN: ['1860-0808', '1434-9922']
DOI: https://doi.org/10.1007/978-3-031-23476-7_8